A New Single-Source Shortest Path Algorithm for Nonnegative Weight Graph
نویسنده
چکیده
The single-source shortest path problem is a classical problem in the research field of graph algorithm. In this paper, a new single-source shortest path algorithm for nonnegative weight graph is proposed. The algorithm can compress multi-round Fibonacci heap operations to one round to save running time relative to Dijkstra’s algorithm using Fibonacci heap. The time complexity of the algorithm is also O(m+nlogn) in the worst case, where m is the number of edges and n is the number of nodes. However, the bound can be linear in some case, for example, when edge weights of a graph are all the same and the hop count of the longest shortest path is much less than n.
منابع مشابه
∆-stepping: a parallelizable shortest path algorithm
The single source shortest path problem for arbitrary directed graphs with n nodes, m edges and nonnegative edge weights can sequentially be solved using O(n · logn+ m) operations. However, no work-efficient parallel algorithm is known that runs in sublinear time for arbitrary graphs. In this paper we present a rather simple algorithm for the single source shortest path problem. Our new algorit...
متن کاملDijkstra ’ s shortest paths algorithm Vassos
Shown below is pseudocode for Dijkstra’s algorithm. The input is a directed graph G = (V,E) with nonnegative edge weights wt(u, v) for every edge (u, v) ∈ E, and a distinguished node s, called the source (or start) node. The algorithm computes, for each node u ∈ V , the weight of a shortest path from s to u. (It can be easily modified to compute, for each node u, the predecessor of u in a short...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملThe Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights
Given an edge-weighted undirected graph and two vertices s and t, the next-to-shortest path problem is to find an st-path whose length is minimum among all st-paths of lengths strictly larger than the shortest path length. The problem is shown to be polynomially solvable if all edge weights are positive, while the complexity status for the nonnegative weight case was open. In this paper we show...
متن کاملMaximum weight bipartite matching in matrix multiplication time
In this paper we consider the problem of finding maximum weight matchings in bipartite graphs with nonnegative integer weights. The presented algorithm for this problemworks in Õ(Wnω)1 time, whereω is thematrixmultiplication exponent, andW is the highest edge weight in the graph. As a consequence of this result we obtain Õ(Wn) time algorithms for computing: minimum weight bipartite vertex cover...
متن کامل